Computer and Modernization ›› 2011, Vol. 1 ›› Issue (1): 20-5.doi: 10.3969/j.issn.1006-2475.2011.01.006

• 算法分析与设计 • Previous Articles     Next Articles

An Algorithm of Rapid Collision Detection Based on Octree and Pipeline

LI Shan, ZHAO Wei, LI Fei   

  1. School of Information Technology, Jilin Agricultural University, Changchun 130118, China
  • Received:2010-09-29 Revised:1900-01-01 Online:2011-01-20 Published:2011-01-20

Abstract:

In view of that virtual environment, where there are massive moving objects, a parallel collision detection algorithm based on octree space division and pipeline is presented. The virtual environment is divided into a series of subspaces by octree division. Then it carries on the collision detection between the nodes in the same subspace. The bounding volumes trees are established for every object in the same subspace. The task trees are established by traversing the bounding trees. The tasks are assigned different processors to deal with. Pipelining and multithreads are adopted, parallel collision detection is realized. Experiment results show that comparing with conventional collision detection based on octree, the efficiency of the algorithm is greatly improved.

Key words: octree, collision detection, pipelining, multithreading, OBB(Oriented Bounding Box)